Primal-dual Circle packing of Planar Maps
نویسنده
چکیده
This work is based on Mohar [1]’s recent algorithm for circle packing for the Euclean case. We implement his polynomial time algorithm for constructing primal-dual circle packings of almost 3-connected planar maps. We have improved Mohar’s algorithm and have been able to get near an order of magnitude speed up for large graphs. We describe our implementation in C/C++ style pseudo-code.
منابع مشابه
Circle Packings of Maps - the Euclidean Case
In an earlier work, the author extended the AndreevKoebe-Thurston circle packing theorem. Additionally, a polynomial time algorithm for constructing primal-dual circle packings of arbitrary (essentially) 3-connected maps was found. In this note, additional details concerning surfaces of constant curvature 0 (with special emphasis on planar graphs where a slightly different treatment is necessar...
متن کاملOn Primal-Dual Circle Representations
The Koebe-Andreev-Thurston Circle Packing Theorem states that every triangulated planar graph has a circle-contact representation. The theorem has been generalized in various ways. The arguably most prominent generalization assures the existence of a primal-dual circle representation for every 3-connected planar graph. The aim of this note is to give a streamlined proof of this result.
متن کاملCircle Packings of Maps in Polynomial Time
The Andreev-Koebe-Thurston circle packing theorem is generalized and improved in two ways. First, we get simultaneous circle packings of the map and its dual map so that, in the corresponding straight-line representations of the map and the dual, any two edges dual to each other are perpendicular. Necessary and sufficient condition for a map to have such a primal-dual circle packing representat...
متن کاملAccurate Circle Conngurations and Numerical Conformal Mapping in Polynomial Time
| According to a remarkable re-interpretation of a theorem of E.M. Andreev (1970) by W.P. Thurston (1982), there is a unique (up to inversive transformations) packing of interior-disjoint circles in the plane, whose contact graph is any given polyhedral graph G, and such that an analagous \dual" circle packing simultaneously exists, whose contact graph is the planar dual graph G , and such that...
متن کاملRigidity of Infinite (circle) Packings
The nerve of a packing is a graph that encodes its combinatorics. The vertices of the nerve correspond to the packed sets, and an edge occurs between two vertices in the nerve precisely when the corresponding sets of the packing intersect. The nerve of a circle packing and other well-behaved packings, on the sphere or in the plane, is a planar graph. It was an observation of Thurston [Thl, Chap...
متن کامل